Universal decoding for source–channel coding with side information
نویسندگان
چکیده
منابع مشابه
Sequential decoding for lossless streaming source coding with side information
The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Universal Decoding for Source–Channel Coding with Side Information
We consider a setting of Slepian–Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, ass...
متن کاملUniversal portfolios with side information
We present a sequential investment algorithm, the -weighted universal portfolio with side-information, which achieves, to rst order in the exponent, the same wealth as the best side-information dependent investment strategy (the best state-constant rebalanced portfolio) determined in hindsight from observed market and side-information outcomes. This is an individual sequence result which shows ...
متن کاملIndex coding with side information
The Index Coding problem has attracted a considerable amount of attention in the recent years. The problem is motivated by several applications in wireless networking and distributed computing. An instance of the index coding problem includes a sender that holds an input x = (x1, x2, . . . , xn) ∈ {0, 1} and communicates with n receivers R1, . . . , Rn using wireless broadcast channel. Each rec...
متن کاملUniversal Coding of Ergodic Sources for Multiple Decoders with Side Information
A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Information and Systems
سال: 2016
ISSN: 1526-7555,2163-4548
DOI: 10.4310/cis.2016.v16.n1.a2